On posets of m-ary words
نویسندگان
چکیده
منابع مشابه
On exact category of $(m, n)$-ary hypermodules
We introduce and study category of $(m, n)$-ary hypermodules as a generalization of the category of $(m, n)$-modules as well as the category of classical modules. Also, we study various kinds of morphisms. Especially, we characterize monomorphisms and epimorphisms in this category. We will proceed to study the fundamental relation on $(m, n)$-hypermodules, as an important tool in the study of a...
متن کاملCanonical (m,n)−ary hypermodules over Krasner (m,n)−ary hyperrings
The aim of this research work is to define and characterize a new class of n-ary multialgebra that may be called canonical (m, n)&minus hypermodules. These are a generalization of canonical n-ary hypergroups, that is a generalization of hypermodules in the sense of canonical and a subclasses of (m, n)&minusary hypermodules. In addition, three isomorphism theorems of module theory and canonical ...
متن کاملDNA-words and word posets
In the paper two variants of a combinatorial problem for the set F q of sequences of length n over the alphabet Fq = {0, 1, .., q − 1} are considered, with some applications. The original problem was the following: what is the smallest k such that every word v ∈ F q is uniquely determined by the set of its subwords of length up to k. This problem was solved by Lothaire [1]. We consider the foll...
متن کاملM-chain graphs of posets
Covering graphs of various types of finite partially ordered sets have been extensively studied since Ore in [2] asked for a characterization of such graphs in general. In this note we introduce a graph, called the m-chain graph of a poset, that reduces to the covering graph when m = 1. Since we will show how to construct the m-chain graph for m > 2 as the 2-chain graph of another poset, we are...
متن کاملOn Coded M-ary Frequency Shift Keying
We discuss the combination of permutation codes and M-ary frequency shift keying. We show that this combination has special properties that can be used in power-line communications: e.g. constant envelopes, and error correction capability for impulsiveand narrow band noise. We give a simple convolutional encoding and decoding scheme. The outputs of a binary convolutional codes are mapped onto c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00256-i